Generating Combinatorial Complexes of Polyhedral Type

نویسنده

  • EGON SCHULTE
چکیده

The paper describes a method for generating combinatorial complexes of polyhedral type. Building blocks B are implanted into the maximal simplices of a simplicial complex C, on which a group operates as a combinatorial reflection group. Of particular interest is the case where B is a polyhedral block and C the barycentric subdivision of a regular incidence-polytope K together with the action of the automorphism group of K.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature” etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. A new, holonomy-type invariant for cubical complexes is introduced, leading to a combinatorial “Theorema Egregium”...

متن کامل

O ct 2 00 5 Combinatorial groupoids , cubical complexes , and the Lovász conjecture

A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature” etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. A new, holonomy-type invariant for cubical complexes is introduced, leading to a combinatorial “Theorema Egregium”...

متن کامل

Some properties of a class of polyhedral semigroups based upon the subword reversing method

In this paper a certain class of polyhedral semigroups which has a presentation $$ is examined‎. ‎The completeness of the presentation and solvability of word problem of this class of semigroups is determined‎. ‎Moreover the combinatorial distance between two words is determined‎.

متن کامل

Local configurations in discrete combinatorial surfaces

Representing discrete objects by polyhedral complexes, we can define all conceivable topological characteristics of points in discrete objects, namely those of vertices of polyhedral complexes. Such a topological characteristic is determined for each point by observing a configuration of object points in the 3 × 3 × 3 local point set of its neighbors. We study a topological characteristic such ...

متن کامل

Type-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes

Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010